/*
 * @Date: 2021-09-05 20:28:39
 * @Author: Acckno1
 * @LastEditTime: 2021-09-07 17:00:13
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

set<int> st;

void add(int n) {
    int sum = 0;
    while (n) {
        sum += n % 10;
        n /= 10;
    }
    st.insert(sum);
}

inline void solution() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i ++ ) {
        int k;
        cin >> k;
        add(k);
    }

    vector<int> res;
    for (auto& s : st) res.push_back(s);
    cout << st.size() << endl;
    cout << res[0];
    for (int i = 1; i < res.size(); i ++ ) cout << " " << res[i];
    cout << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}